Chawla—Numerov method revisited

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Double Description Method Revisited

The double description method is a simple and useful algorithm for enumerating all extreme rays of a general polyhedral cone in IR d , despite the fact that we can hardly state any interesting theorems on its time and space complexities. In this paper, we reinvestigate this method, introduce some new ideas for eecient implementations, and show some empirical results indicating its practicality ...

متن کامل

Ball’s Formula Method Revisited

This manuscript describes a review and analysis of the correction factor for come-up time (CUT), introduced by Dr. C. Olin Ball in his famous Formula Method for thermal process calculations. This correction factor has commonly been considered applicable only to the Ball Formula method. In the alternative General Method, the effect of CUT is automatically included in the calculated lethality val...

متن کامل

Mel’nikov method revisited

We illustrate a completely analytic approach to Mel’nikov theory, which is based on a suitable extension of a classical method, and which is parallel and – at least in part – complementary to the standard procedure. This approach can be also applied to some “degenerate” situations, as to the case of nonhyperbolic unstable points, or of critical points located at the infinity (thus giving rise t...

متن کامل

QUICKSELECT Revisited

We give an overview of the running time analysis of the random divide-and-conquer algorithm FIND or QUICKSELECT. The results concern moments, distribution of FIND’s running time, the limiting distribution, a stochastic bound and the key: a stochastic fixed point equation.

متن کامل

The proximal point method revisited∗

In this short survey, I revisit the role of the proximal point method in large scale optimization. I focus on three recent examples: a proximally guided subgradient method for weakly convex stochastic approximation, the prox-linear algorithm for minimizing compositions of convex functions and smooth maps, and Catalyst generic acceleration for regularized Empirical Risk Minimization.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Computational and Applied Mathematics

سال: 1991

ISSN: 0377-0427

DOI: 10.1016/0377-0427(91)90030-n